A Test Matrix Collection for Non-Hermitian Eigenvalue Problems
نویسندگان
چکیده
The primary purpose of this collection is to provide a testbed for the development of numerical algorithms for solving nonsymmetric eigenvalue problems. In addition, as with many other existing collections of test matrices, our goal includes providing an easy access to \practical" eigenproblems for researchers, educators and students in the community who are interested in the origins of large scale nonsymmetric eigenvalue problems, and in the development and testing of numerical algorithms for solving challenging non-Hermitian eigenvalue problems in real applications. In this document, we describe the mechanism for obtaining a copy of the matrices and for using the collection. All test matrices currently included in the collection are documented in Appendices.
منابع مشابه
ABLE: An Adaptive Block Lanczos Method for Non-Hermitian Eigenvalue Problems
This work presents an adaptive block Lanczos method for large-scale non-Hermitian Eigenvalue problems (henceforth the ABLE method). The ABLE method is a block version of the non-Hermitian Lanczos algorithm. There are three innovations. First, an adaptive blocksize scheme cures (near) breakdown and adapts the blocksize to the order of multiple or clustered eigenvalues. Second, stopping criteria ...
متن کاملOn the modification of an eigenvalue problem that preserves an eigenspace
Eigenvalue problems arise in many application areas ranging from computational fluid dynamics to information retrieval. In these fields we are often interested in only a few eigenvalues and corresponding eigenvectors of a sparse matrix. In this paper, we comment on the modifications of the eigenvalue problem that can simplify the computation of those eigenpairs. These transformations allow us t...
متن کاملPerturbation of Partitioned Hermitian Definite Generalized Eigenvalue Problems
This paper is concerned with the Hermitian definite generalized eigenvalue problem A− λB for block diagonal matrices A 1⁄4 diagðA11; A22Þ and B 1⁄4 diagðB11; B22Þ. Both A and B are Hermitian, and B is positive definite. Bounds on how its eigenvalues vary when A and B are perturbed by Hermitian matrices are established. These bounds are generally of linear order with respect to the perturbations...
متن کاملArnoldi-Faber method for large non hermitian eigenvalue problems
We propose a restarted Arnoldi’s method with Faber polynomials and discuss its use for computing the rightmost eigenvalues of large non hermitian matrices. We illustrate, with the help of some practical test problems, the benefit obtained from the Faber acceleration by comparing this method with the Chebyshev based acceleration. A comparison with the implicitly restarted Arnoldi method is also ...
متن کاملSubspace Iteration on Steroids – A New Highly Parallel Non-Hermitian Eigensolver
Calculating portions of eigenvalues and eigenvectors of matrices or matrix pencils has many applications. An approach to this calculation for Hermitian problems based on a density matrix has been proposed in 2009 and a software package called FEAST has been developed. The density-matrix approach allows FEAST’s implementation to exploit a key strength of modern computer architectures, namely, mu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1996